Computability logic - PDFSEARCH.IO - Document Search Engine

Computability logic
Results: 552

#	Item
121	Toward abstract profiling Nguyen-Minh BUI D´epartement d’informatique et de g´enie logiciel, Universit´e Laval, Canada Add to Reading List Source URL: repository.readscheme.org Language: English - Date: 2012-08-10 19:21:20 Combinatory logic Lambda calculus Procedural programming languages Computability theory Eval Fixed-point combinator Function Expression Conditional Mathematics Theoretical computer science Computing
122	Computationally-based Agnostic Induction/Inference Terrence L. Fine School of Electrical & Computer Engrng Cornell University UCB on 29 November 2007 Add to Reading List Source URL: hplms.berkeley.edu Language: English - Date: 2015-03-14 17:56:40 Statistical inference Reasoning Computability theory Turing machine Epistemology Inductive inference Inductive reasoning Inference Kolmogorov complexity Science Logic Knowledge
123	Preface Computable analysis is a branch of computability theory studying those functions on the real numbers and related sets which can be computed by machines such as digital computers. The increasing demand for reliab Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2009-09-05 02:34:00 Mathematical logic Computable function Computable number Computable analysis Computable real function Specker sequence Enumeration Computability Numbering Computability theory Theory of computation Theoretical computer science
124	Well-founded Recursion over Contextual Objects Brigitte Pientka1 and Andreas Abel2 1 2 Add to Reading List Source URL: www2.tcs.ifi.lmu.de Language: English - Date: 2015-02-07 05:55:59 Functions and mappings Model theory Computability theory Interpretation Philosophy of mind Semantics Primitive recursive function Function First-order logic Mathematical logic Mathematics Logic
125	PRELIMINARY EXAMINATION GROUP IN LOGIC AND THE METHODOLOGY OF SCIENCE For the following questions we fix a standard enumeration h ϕe : e ∈ ω i of the partial recursive functions with the corresponding enumeration hWe Add to Reading List Source URL: logic.berkeley.edu Language: English Theory of computation Recursively enumerable set Enumeration Model theory Presentation of a group Ordinal number Ω-consistent theory Mathematics Mathematical logic Computability theory
126	Full reduction in the face of absurdity Gabriel Scherer, Didier R´emy Gallium – INRIA October 28, 2014 Add to Reading List Source URL: gallium.inria.fr Language: English - Date: 2014-10-28 06:28:38 Mathematical logic Computability theory Lambda calculus Proof theory Orbifold Natural deduction Theoretical computer science Models of computation Applied mathematics
127	arXiv:1204.6671v1 [cs.LO] 30 Apr 2012 δ-Decidability over the Reals∗ Sicun Gao, Jeremy Avigad, and Edmund M. Clarke Carnegie Mellon University, Pittsburgh, PAMay 1, 2012 Add to Reading List Source URL: arxiv.org Language: English - Date: 2012-04-30 22:29:41 Mathematical logic Theory of computation Computable number Computable function Bounded quantifier Computable real function Function Oracle machine Decision problem Computability theory Theoretical computer science Mathematics
128	Structural Recursion over Contextual Objects Brigitte Pientka and Sherry Shanshan Ruan Andreas Abel School of Computer Science Add to Reading List Source URL: www2.tcs.ifi.lmu.de Language: English - Date: 2014-01-20 17:12:51 Functions and mappings Model theory Formal languages Metalogic Computability theory Symbol Interpretation Primitive recursive function Substitution Logic Mathematics Mathematical logic
129	Chapter 1 Rewriting Nachum Dershowitz David A. Plaisted Add to Reading List Source URL: rewriting.loria.fr Language: English - Date: 2001-02-15 10:07:19 Applied mathematics Logic in computer science Mathematical logic Rewriting Computability theory Semi-Thue system Differential equation Normal form Linear equation Theoretical computer science Mathematics Formal languages
130	Logic and the Methodology of Science Autumn 2002 Preliminary Exam Draft August 23, Let ϕe be the eth partial recursive function in some standard enumeration, and let We be the domain of ϕe ). Show that there is Add to Reading List Source URL: logic.berkeley.edu Language: English - Date: 2014-08-24 16:43:20 Theory of computation Theoretical computer science Metalogic Model theory Recursively enumerable set Constructible universe Presentation of a group Ordinal number Ω-consistent theory Mathematics Mathematical logic Computability theory

UPDATE